Algorithms for constrained k-nearest neighbor queries over moving object trajectories
نویسندگان
چکیده
منابع مشابه
Reverse-Nearest Neighbor Queries on Uncertain Moving Object Trajectories
Reverse nearest neighbor (RNN) queries in spatial and spatio-temporal databases have received significant attention in the database research community over the last decade. A reverse nearest neighbor (RNN) query finds the objects having a given query object as its nearest neighbor. RNN queries find applications in data mining, marketing analysis, and decision making. Most previous research on R...
متن کاملProbabilistic Nearest Neighbor Queries on Uncertain Moving Object Trajectories
Nearest neighbor (NN) queries in trajectory databases have received significant attention in the past, due to their application in spatiotemporal data analysis. Recent work has considered the realistic case where the trajectories are uncertain; however, only simple uncertainty models have been proposed, which do not allow for accurate probabilistic search. In this paper, we fill this gap by add...
متن کاملAlgorithms for Nearest Neighbor Search on Moving Object Trajectories
Nearest Neighbor (NN) search has been in the core of spatial and spatiotemporal database research during the last decade. The literature on NN query processing algorithms so far deals with either stationary or moving query points over static datasets or future (predicted) locations over a set of continuously moving points. With the increasing number of Mobile Location Services (MLS), the need f...
متن کاملEfficient Algorithms to Monitor Continuous Constrained k Nearest Neighbor Queries
Continuous monitoring of spatial queries has received significant research attention in the past few years. In this paper, we propose two efficient algorithms for the continuous monitoring of the constrained k nearest neighbor (kNN) queries. In contrast to the conventional k nearest neighbors (kNN) queries, a constrained kNN query considers only the objects that lie within a region specified by...
متن کاملNearest Neighbor Search on Moving Object Trajectories
With the increasing number of Mobile Location Services (MLS), the need for effective k-NN query processing over historical trajectory data has become the vehicle for data analysis, thus improving existing or even proposing new services. In this paper, we investigate mechanisms to perform NN search on R-tree-like structures storing historical information about moving object trajectories. The pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: GeoInformatica
سال: 2009
ISSN: 1384-6175,1573-7624
DOI: 10.1007/s10707-009-0084-5